Computation of interpolatory splines via triadic subdivision
نویسندگان
چکیده
We present an algorithm for computation of interpolatory splines of arbitrary order at triadic rational points. The algorithm is based on triadic subdivision of splines. Explicit expressions for the subdivision symbols are established. These are rational functions. The computations are implemented by recursive filtering.
منابع مشابه
Ternary interpolatory Subdivision Schemes Originated from splines
A generic technique for construction of ternary interpolatory subdivision schemes, which is based on polynomial and discrete splines, is presented. These schemes have rational symbols. The symbols are explicitly presented in the paper. This is accompanied by a detailed description of the design of the refinement masks and by algorithms that verify the convergence of these schemes. In addition, ...
متن کاملNon-uniform interpolatory subdivision via splines
We present a framework for deriving non-uniform interpolatory subdivision algorithms closely related to non-uniform spline interpolants. Families of symmetric non-uniform interpolatory 2n-point schemes of smoothness C are presented for n = 2, 3, 4 and even higher order, as well as a variety of non-uniform 6-point schemes with C continuity.
متن کاملInterpolatory Subdivision Schemes Induced by Box Splines
This paper is devoted to a study of interpolatory refinable functions. If a refinable function φ on Rs is continuous and fundamental, i.e., φ(0) = 1 and φ(α) = 0 for α ∈ Zs\{0}, then its corresponding mask b satisfies b(0) = 1 and b(2α) = 0 for all α ∈ Zs\{0}. Such a refinement mask is called an interpolatory mask. We establish the existence and uniqueness of interpolatory masks which are induc...
متن کاملA Construction of Bi orthogonal Functions to B splines with Multiple Knots
We present a construction of a re nable compactly supported vector of functions which is bi orthogonal to the vector of B splines of a given degree with multiple knots at the integers with prescribed multiplicity The construction is based on Hermite interpolatory subdivision schemes and on the relation between B splines and divided di erences The bi orthogonal vector of functions is shown to be...
متن کاملFast Computation by Subdivision of Multidimensional Splines and Their Applications
We present theory and algorithms for fast explicit computations of uniand multi-dimensional periodic splines of arbitrary order at triadic rational points and of splines of even order at diadic rational points. The algorithms use the forward and the inverse Fast Fourier transform (FFT). The implementation is as fast as FFT computation. The algorithms are based on binary and ternary subdivision ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Adv. Comput. Math.
دوره 32 شماره
صفحات -
تاریخ انتشار 2010